Graph Rewriting for the π - calculus †
نویسندگان
چکیده
We propose a graphical implementation for (possibly recursive) processes of the π-calculus, encoding each process into a graph. Our implementation is sound and complete with respect to the structural congruence for the calculus: Two processes are equivalent if and only if they are mapped into graphs with the same normal form. Most importantly, the encoding allows the use of standard graph rewriting mechanisms for modeling the reduction semantics of the calculus.
منابع مشابه
A Graph Rewriting Semantics for the Polyadic Calculus
We give a hypergraph rewriting semantics for the polyadic π-calculus, based on rewriting rules equivalent to those in the double-pushout approach. The structural congruence of the π-calculus is replaced by hypergraph isomorphism. The correctness of the encoding from the graph-based notation into π-calculus can be shown by using an intermediate notation, so-called name-based graph terms.
متن کاملMultiport Interaction Nets and Concurrency
We consider an extension of Lafont’s Interaction Nets, called Multiport Interaction Nets, and show that they are a model of concurrent computation by encoding the full π-calculus in them. We thus obtain a faithful graphical representation of the π-calculus in which every reduction step is decomposed in fully local graph-rewriting rules.
متن کاملPrimitives for Contract-based Synchronization
We investigate how contracts can be used to regulate the interaction between processes. To do that, we study a variant of the concurrent constraints calculus presented in [2] , featuring primitives for multiparty synchronization via contracts. We proceed in two directions. First, we exploit our primitives to model some contract-based interactions. Then, we discuss how several models for concurr...
متن کاملA Translation of the Pi-Calculus Into MONSTR
A translation of the π-calculus into the MONSTR graph rewriting language is described and proved correct. The translation illustrates the heavy cost in practice of faithfully implementing the communication primitive of the π-calculus and similar process calculi. It also illustrates the convenience of representing an evolving network of communicating agents directly within a graph manipulation f...
متن کاملA Translation of the Pi-Caculus Into MONSTR
A translation of the π-calculus into the MONSTR graph rewriting language is described and proved correct. The translation illustrates the heavy cost in practice of faithfully implementing the communication primitive of the π-calculus and similar process calculi. It also illustrates the convenience of representing an evolving network of communicating agents directly within a graph manipulation f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006